Comparing Different Approaches on the Door Assignment Problem in LTL-Terminals

نویسندگان

  • Boris Naujoks
  • Annette Chmielewski
چکیده

The work at hand yields two different ways to address the assignment of inbound and outbound doors in less-than-truckload terminals. The considered optimization methods stem from two different scientific fields, which makes the comparison of the techniques a very interesting topic. The first solution approach origins from the field of discrete mathematics. For this purpose, the logistical optimization task is modeled as a time-discrete multi-commodity flow problem with side constraints. Based on this model, a decomposition approach and a modified column generation approach are developed. The second considered optimization method is an evolutionary multi-objective optimization algorithm (EMOA). This approach is able to handle different optimization goals in parallel. Both algorithms are applied to ten test scenarios yielding different numbers of tours, doors, loading areas, and affected relations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Door Allocations to Origins and Destinations at Less-than-Truckload Trucking Terminals

For an LTL (Less-than Truckload) carrier, the allocation of doors at a consolidation facility to outbound trailers assigned to various destinations, and to inbound trailers in the continuous stream arriving from various origins, has a significant impact on its operations, and on the nightly man-hours needed for consolidation. In the past literature door allocations to destinations of outbound t...

متن کامل

Different Network Performance Measures in a Multi-Objective Traffic Assignment Problem

Traffic assignment algorithms are used to determine possible use of paths between origin-destination pairs and predict traffic flow in network links. One of the main deficiencies of ordinary traffic assignment methods is that in most of them one measure (mostly travel time) is usually included in objective function and other effective performance measures in traffic assignment are not considere...

متن کامل

Addressing a Coordinated Quay Crane Scheduling and Assignment Problem by Red Deer Algorithm

Nowadays, there is much attention for planning of container terminals in the global trade centers. The high cost of quay cranes motivates both scholars and industrial practitioners especially in the last decade to develop novel optimization models to address this dilemma. This study proposes a coordinated optimization model to cover both Quay Crane Scheduling Problem (QCSP) and Quay Crane Assig...

متن کامل

Scheduling Single-Load and Multi-Load AGVs in Container Terminals

In this paper, three solutions for scheduling problem of the Single-Load and Multi-Load Automated Guided Vehicles (AGVs) in Container Terminals are proposed. The problem is formulated as Constraint Satisfaction and Optimization. When capacity of the vehicles is one container, the problem is a minimum cost flow model. This model is solved by the highest performance Algorithm, i.e. Network Simple...

متن کامل

Quay Cranes and Yard Trucks Scheduling Problem at Container Terminals

A bi-objective mathematical model is developed to simultaneously consider the quay crane and yard truck scheduling problems at container terminals. Main real-world assumptions, such as quay cranes with non-crossing constraints, quay cranes’ safety margins and precedence constraints are considered in this model. This integrated approach leads to better efficiency and productivity at container te...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009